SCARLET-1.0: SpheriCal Approximation for viRtuaL aggrEgaTes

نویسندگان

چکیده

Abstract. Aggregation of particles occurs in a large variety settings and is therefore the focus many disciplines, e.g., Earth environmental sciences, astronomy, meteorology, pharmacy, food industry. In particular, volcanology, ash aggregation deeply influences sedimentation volcanic atmosphere during after eruption, affecting accuracy model predictions evaluation hazard risk assessments. It thus very important to provide an exhaustive description outcome process, starting from its basic geometrical features such as position space components overall porosity final object. Here we present SCARLET-1.0, MATLAB package specifically created 3D virtual reconstruction for aggregates generated central collision processes. centrally oriented collisions, build up their own structure around first particle (the core), acting seed. This appropriate turbulent flows which show different degrees coupling with respect eddies. SCARLET-1.0 belongs class sphere-composite algorithms, family algorithms that approximate complex shapes terms set nonoverlapping spheres. The conversion surface equivalent then allows analytical detection intersections between objects aggregate together. Thus, provided list colliding sizes shapes, places each element vector core, minimizing distances centers mass. user can play parameters control minimization process. Among them most ones are cone investigation (Ω), number rays per (Nr), orientations object (No). All described using Standard Triangulation Language (STL) format, current standard printing. one key results unlimited range applications package. main code representation object, size, porosity, density, associated STL file. addition, be potentially printed. As example, has been applied here ellipsoid–ellipsoid collisions more specific analysis aggregation. application two ellipsoids less than 20 % if flatness elongation greater or equal 0.5. Higher values porosities (up 40 %–50 %) instead found needle-like extremely flat shapes. second application, reconstruct evolution time characterized by inner structures. We find whose population narrow distribution tend rapidly reach plateau porosity. reproduce observed densities, almost no compaction necessary result suggests how not well maximum packing condition.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-scale Simulation of Spherical Aggregates

This paper presents a method to simulate high density non overlapping sphere structures with anisotropy and heterogeneity.

متن کامل

Spherical Structured Feature Maps for Kernel Approximation

We propose Spherical Structured Feature (SSF) maps to approximate shift and rotation invariant kernels as well as b-order arc-cosine kernels (Cho & Saul, 2009). We construct SSF maps based on the point set on d − 1 dimensional sphere Sd−1. We prove that the inner product of SSF maps are unbiased estimates for above kernels if asymptotically uniformly distributed point set on Sd−1 is given. Acco...

متن کامل

A Fast Algorithm for Spherical Basis Approximation

Radial basis functions appear in a wide field of applications in numerical mathematics and computer science. We present a fast algorithm for scattered data interpolation and approximation on the sphere with spherical radial basis functions of different spatial density. We discuss three settings, each leading to a special structure of the interpolation matrix allowing for an efficient implementa...

متن کامل

Rescaled Mean Spherical Approximation for Colloidal Mixtures

In this work, the resealed mean spherical approximation (RMSA) for colloidal mixtures interacting via a DLVO-type potential is developed, and its application to suspensions of highly charged macroions is illustrated. For this purpose we introduce a simple scheme to solve the mean spherical approximation (MSA) for Yukawa mixtures with factorized coupling parameters. This scheme consists of the m...

متن کامل

Convex Approximation by Spherical Patches

Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geoscientific Model Development

سال: 2021

ISSN: ['1991-9603', '1991-959X']

DOI: https://doi.org/10.5194/gmd-14-4379-2021